منابع مشابه
Estimating Graph Parameters from Random Order Streams
We develop a new algorithmic technique that allows to transfer some constant time approximation algorithms for general graphs into random order streaming algorithms. We illustrate our technique by proving that in random order streams with probability at least 2/3, • the number of connected components of G can be approximated up to an additive error of εn using (1ε ) O(1/ε) space, • the weight o...
متن کاملOn Estimating Maximum Matching Size in Graph Streams
We study the problem of estimating the maximum matching size in graphs whose edges are revealed in a streaming manner. We consider both insertion-only streams, which only contain edge insertions, and dynamic streams that allow both insertions and deletions of the edges, and present new upper and lower bound results for both cases. On the upper bound front, we show that an αapproximate estimate ...
متن کاملFrogWild! - Fast PageRank Approximations on Graph Engines
We propose FrogWild, a novel algorithm for fast approxi-mation of high PageRank vertices, geared towards reducingnetwork costs of running traditional PageRank algorithms.Our algorithm can be seen as a quantized version of poweriteration that performs multiple parallel random walks overa directed graph. One important innovation is that we in-troduce a modification to the ...
متن کاملOn Clustering Graph Streams
In this paper, we will examine the problem of clustering massive graph streams. Graph clustering poses significant challenges because of the complex structures which may be present in the underlying data. The massive size of the underlying graph makes explicit structural enumeration very difficult. Consequently, most techniques for clustering multi-dimensional data are difficult to generalize t...
متن کاملOn Summarizing Graph Streams
Graph streams, which refer to the graph with edges being updated sequentially in a form of a stream, have wide applications such as cyber security, social networks and transportation networks. This paper studies the problem of summarizing graph streams. Specifically, given a graph stream G, directed or undirected, the objective is to summarize G as SG with much smaller (sublinear) space, linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2011
ISSN: 0004-5411,1557-735X
DOI: 10.1145/1970392.1970397